Strong and Weak Virtual Synchrony in Horus

نویسندگان

  • Roy Friedman
  • Robbert van Renesse
چکیده

A formal de nition of strong virtual synchrony capturing the semantics of virtual syn chrony as implemented in Horus is presented This de nition has the nice property that every message is delivered within the view in which it was sent However it is shown that in order to implement strong virtual synchrony the application program has to block messages during view changes An alternative de nition called weak virtual synchrony which can be implemented without blocking messages is then presented This de nition still guarantees that messages will be delivered within the view in which they were sent only that it uses a slightly weaker notion of what the view in which a message was sent is An implementation of weak virtual synchrony that does not block messages during view changes is developed and it is shown how to use a system that provides weak virtual synchrony even when strong virtual synchrony is actually needed To capture additional ordering requirements the de nition of ordered virtual synchrony is presented Finally it is discussed how to extend the de nitions in order to cope with the fact that a process can become a member of more than one group This work was supported by ARPA ONR grant N J

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Transparent Light-Weight Group Service

The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementations of virtual synchrony usually require the use of failure detectors and failure recovery protocols. In applications that require the use of a large number of groups, significant performance gains can be attained if these groups share the resources require...

متن کامل

Horus: A Flexible Group Communications System

If a broad de nition of \process group" is accepted, process group structures can be identied in a great number of distributed systems and protocols. Groups of processes are used in embedded systems (for example to implement TMR voting), clock synchronization, le system caching, and are employed in operating systems like UNIX for signal delivery. The V [4] and Chorus [1] operating systems have ...

متن کامل

A Dynamic Light-Weight Group Service

The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementations of virtual synchrony usually require the use of failure detectors and failure recovery protocols. In applications that require the use of a large number of groups, signi cant performance gains can be attained if these groups share the resources required...

متن کامل

Dynamic Light-Weight Groups

The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that use a large number of groups, signi cant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups onto instances of a virtually synchronous implementation is called...

متن کامل

Fighting Fire with Fire: Using Randomized Gossip to Combat Stochastic Scalability Limits

ly, let M be the number of copies of a single multicast that a member receives from the lower dissemination layer. For the Pbcast implementation, since each member gossips a given multicast for O(log(n)) gossip rounds and to randomly chosen targets, we have M = O(log(n)). To maximize the throughput, one would want to minimize the number of copies M of a multicast that a member receives from the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996